37 research outputs found

    Toward robust deep neural networks

    Get PDF
    Dans cette thĂšse, notre objectif est de dĂ©velopper des modĂšles d’apprentissage robustes et fiables mais prĂ©cis, en particulier les Convolutional Neural Network (CNN), en prĂ©sence des exemples anomalies, comme des exemples adversaires et d’échantillons hors distribution –Out-of-Distribution (OOD). Comme la premiĂšre contribution, nous proposons d’estimer la confiance calibrĂ©e pour les exemples adversaires en encourageant la diversitĂ© dans un ensemble des CNNs. À cette fin, nous concevons un ensemble de spĂ©cialistes diversifiĂ©s avec un mĂ©canisme de vote simple et efficace en termes de calcul pour prĂ©dire les exemples adversaires avec une faible confiance tout en maintenant la confiance prĂ©dicative des Ă©chantillons propres Ă©levĂ©e. En prĂ©sence de dĂ©saccord dans notre ensemble, nous prouvons qu’une borne supĂ©rieure de 0:5 + _0 peut ĂȘtre Ă©tablie pour la confiance, conduisant Ă  un seuil de dĂ©tection global fixe de tau = 0; 5. Nous justifions analytiquement le rĂŽle de la diversitĂ© dans notre ensemble sur l’attĂ©nuation du risque des exemples adversaires Ă  la fois en boĂźte noire et en boĂźte blanche. Enfin, nous Ă©valuons empiriquement la robustesse de notre ensemble aux attaques de la boĂźte noire et de la boĂźte blanche sur plusieurs donnĂ©es standards. La deuxiĂšme contribution vise Ă  aborder la dĂ©tection d’échantillons OOD Ă  travers un modĂšle de bout en bout entraĂźnĂ© sur un ensemble OOD appropriĂ©. À cette fin, nous abordons la question centrale suivante : comment diffĂ©rencier des diffĂ©rents ensembles de donnĂ©es OOD disponibles par rapport Ă  une tĂąche de distribution donnĂ©e pour sĂ©lectionner la plus appropriĂ©e, ce qui induit Ă  son tour un modĂšle calibrĂ© avec un taux de dĂ©tection des ensembles inaperçus de donnĂ©es OOD? Pour rĂ©pondre Ă  cette question, nous proposons de diffĂ©rencier les ensembles OOD par leur niveau de "protection" des sub-manifolds. Pour mesurer le niveau de protection, nous concevons ensuite trois nouvelles mesures efficaces en termes de calcul Ă  l’aide d’un CNN vanille prĂ©formĂ©. Dans une vaste sĂ©rie d’expĂ©riences sur les tĂąches de classification d’image et d’audio, nous dĂ©montrons empiriquement la capacitĂ© d’un CNN augmentĂ© (A-CNN) et d’un CNN explicitement calibrĂ© pour dĂ©tecter une portion significativement plus grande des exemples OOD. Fait intĂ©ressant, nous observons Ă©galement qu’un tel A-CNN (nommĂ© A-CNN) peut Ă©galement dĂ©tecter les adversaires exemples FGS en boĂźte noire avec des perturbations significatives. En tant que troisiĂšme contribution, nous Ă©tudions de plus prĂšs de la capacitĂ© de l’A-CNN sur la dĂ©tection de types plus larges d’adversaires boĂźte noire (pas seulement ceux de type FGS). Pour augmenter la capacitĂ© d’A-CNN Ă  dĂ©tecter un plus grand nombre d’adversaires,nous augmentons l’ensemble d’entraĂźnement OOD avec des Ă©chantillons interpolĂ©s inter-classes. Ensuite, nous dĂ©montrons que l’A-CNN, entraĂźnĂ© sur tous ces donnĂ©es, a un taux de dĂ©tection cohĂ©rent sur tous les types des adversaires exemples invisibles. Alors que la entraĂźnement d’un A-CNN sur des adversaires PGD ne conduit pas Ă  un taux de dĂ©tection stable sur tous les types d’adversaires, en particulier les types inaperçus. Nous Ă©valuons Ă©galement visuellement l’espace des fonctionnalitĂ©s et les limites de dĂ©cision dans l’espace d’entrĂ©e d’un CNN vanille et de son homologue augmentĂ© en prĂ©sence d’adversaires et de ceux qui sont propres. Par un A-CNN correctement formĂ©, nous visons Ă  faire un pas vers un modĂšle d’apprentissage debout en bout unifiĂ© et fiable avec de faibles taux de risque sur les Ă©chantillons propres et les Ă©chantillons inhabituels, par exemple, les Ă©chantillons adversaires et OOD. La derniĂšre contribution est de prĂ©senter une application de A-CNN pour l’entraĂźnement d’un dĂ©tecteur d’objet robuste sur un ensemble de donnĂ©es partiellement Ă©tiquetĂ©es, en particulier un ensemble de donnĂ©es fusionnĂ©. La fusion de divers ensembles de donnĂ©es provenant de contextes similaires mais avec diffĂ©rents ensembles d’objets d’intĂ©rĂȘt (OoI) est un moyen peu coĂ»teux de crĂ©er un ensemble de donnĂ©es Ă  grande Ă©chelle qui couvre un plus large spectre d’OoI. De plus, la fusion d’ensembles de donnĂ©es permet de rĂ©aliser un dĂ©tecteur d’objet unifiĂ©, au lieu d’en avoir plusieurs sĂ©parĂ©s, ce qui entraĂźne une rĂ©duction des coĂ»ts de calcul et de temps. Cependant, la fusion d’ensembles de donnĂ©es, en particulier Ă  partir d’un contexte similaire, entraĂźne de nombreuses instances d’étiquetĂ©es manquantes. Dans le but d’entraĂźner un dĂ©tecteur d’objet robuste intĂ©grĂ© sur un ensemble de donnĂ©es partiellement Ă©tiquetĂ©es mais Ă  grande Ă©chelle, nous proposons un cadre d’entraĂźnement auto-supervisĂ© pour surmonter le problĂšme des instances d’étiquettes manquantes dans les ensembles des donnĂ©es fusionnĂ©s. Notre cadre est Ă©valuĂ© sur un ensemble de donnĂ©es fusionnĂ© avec un taux Ă©levĂ© d’étiquettes manquantes. Les rĂ©sultats empiriques confirment la viabilitĂ© de nos pseudo-Ă©tiquettes gĂ©nĂ©rĂ©es pour amĂ©liorer les performances de YOLO, en tant que dĂ©tecteur d’objet Ă  la pointe de la technologie.In this thesis, our goal is to develop robust and reliable yet accurate learning models, particularly Convolutional Neural Networks (CNNs), in the presence of adversarial examples and Out-of-Distribution (OOD) samples. As the first contribution, we propose to predict adversarial instances with high uncertainty through encouraging diversity in an ensemble of CNNs. To this end, we devise an ensemble of diverse specialists along with a simple and computationally efficient voting mechanism to predict the adversarial examples with low confidence while keeping the predictive confidence of the clean samples high. In the presence of high entropy in our ensemble, we prove that the predictive confidence can be upper-bounded, leading to have a globally fixed threshold over the predictive confidence for identifying adversaries. We analytically justify the role of diversity in our ensemble on mitigating the risk of both black-box and white-box adversarial examples. Finally, we empirically assess the robustness of our ensemble to the black-box and the white-box attacks on several benchmark datasets.The second contribution aims to address the detection of OOD samples through an end-to-end model trained on an appropriate OOD set. To this end, we address the following central question: how to differentiate many available OOD sets w.r.t. a given in distribution task to select the most appropriate one, which in turn induces a model with a high detection rate of unseen OOD sets? To answer this question, we hypothesize that the “protection” level of in-distribution sub-manifolds by each OOD set can be a good possible property to differentiate OOD sets. To measure the protection level, we then design three novel, simple, and cost-effective metrics using a pre-trained vanilla CNN. In an extensive series of experiments on image and audio classification tasks, we empirically demonstrate the abilityof an Augmented-CNN (A-CNN) and an explicitly-calibrated CNN for detecting a significantly larger portion of unseen OOD samples, if they are trained on the most protective OOD set. Interestingly, we also observe that the A-CNN trained on the most protective OOD set (calledA-CNN) can also detect the black-box Fast Gradient Sign (FGS) adversarial examples. As the third contribution, we investigate more closely the capacity of the A-CNN on the detection of wider types of black-box adversaries. To increase the capability of A-CNN to detect a larger number of adversaries, we augment its OOD training set with some inter-class interpolated samples. Then, we demonstrate that the A-CNN trained on the most protective OOD set along with the interpolated samples has a consistent detection rate on all types of unseen adversarial examples. Where as training an A-CNN on Projected Gradient Descent (PGD) adversaries does not lead to a stable detection rate on all types of adversaries, particularly the unseen types. We also visually assess the feature space and the decision boundaries in the input space of a vanilla CNN and its augmented counterpart in the presence of adversaries and the clean ones. By a properly trained A-CNN, we aim to take a step toward a unified and reliable end-to-end learning model with small risk rates on both clean samples and the unusual ones, e.g. adversarial and OOD samples.The last contribution is to show a use-case of A-CNN for training a robust object detector on a partially-labeled dataset, particularly a merged dataset. Merging various datasets from similar contexts but with different sets of Object of Interest (OoI) is an inexpensive way to craft a large-scale dataset which covers a larger spectrum of OoIs. Moreover, merging datasets allows achieving a unified object detector, instead of having several separate ones, resultingin the reduction of computational and time costs. However, merging datasets, especially from a similar context, causes many missing-label instances. With the goal of training an integrated robust object detector on a partially-labeled but large-scale dataset, we propose a self-supervised training framework to overcome the issue of missing-label instances in the merged datasets. Our framework is evaluated on a merged dataset with a high missing-label rate. The empirical results confirm the viability of our generated pseudo-labels to enhance the performance of YOLO, as the current (to date) state-of-the-art object detector

    A Principled Approach for Learning Task Similarity in Multitask Learning

    Full text link
    Multitask learning aims at solving a set of related tasks simultaneously, by exploiting the shared knowledge for improving the performance on individual tasks. Hence, an important aspect of multitask learning is to understand the similarities within a set of tasks. Previous works have incorporated this similarity information explicitly (e.g., weighted loss for each task) or implicitly (e.g., adversarial loss for feature adaptation), for achieving good empirical performances. However, the theoretical motivations for adding task similarity knowledge are often missing or incomplete. In this paper, we give a different perspective from a theoretical point of view to understand this practice. We first provide an upper bound on the generalization error of multitask learning, showing the benefit of explicit and implicit task similarity knowledge. We systematically derive the bounds based on two distinct task similarity metrics: H divergence and Wasserstein distance. From these theoretical results, we revisit the Adversarial Multi-task Neural Network, proposing a new training algorithm to learn the task relation coefficients and neural network parameters iteratively. We assess our new algorithm empirically on several benchmarks, showing not only that we find interesting and robust task relations, but that the proposed approach outperforms the baselines, reaffirming the benefits of theoretical insight in algorithm design

    The Risk Factors of Prolonged Mechanical Ventilation after Isolated Coronary Artery Bypass Graft Surgery

    Get PDF
    Background: Failure to wean a patient from mechanical ventilation after cardiac surgery is associatedwith poor outcome.Aim: The present study was performed aimed to investigate the risk factors of prolonged mechanicalventilation (PMV) following isolated coronary artery bypass graft (CABG) surgery.Method: This retrospective cohort study was performed on 2155 consecutive adult patientsundergoing isolated coronary artery bypass graft surgery (May 2012 to November 2016 at Imam Rezahospital, Mashhad, Iran). The subjects were assessed for duration of weaning from mechanicalventilation, predictive risk factors for prolonged mechanical ventilation and associated outcomesincluding intensive care unit (ICU) and hospital length of stay (LOS), and mortality. Data wereanalyzed by SPSS (version 22). P<0.05 was considered statistically significant.Results: The median (25 -75 percentile) duration of mechanical ventilation was 360 (225-540)minutes. Also, 51.20%, 45.80% and 2.30% patients were weaned from mechanical ventilation in lessthan 6 hours, 7 to 24 hours, and more than 24 hours, respectively. Cerebral vascular accident was themost common cause of PMV (34.04%). After adjustment for confounder variables, on-pump CABG(P<0.05), duration of surgery (P<0.01), preoperative renal failure (P<0.05) and New York HeartAssociation (NYHA) class 4 were associated with PMV (P <0.05). PMV was associated withincreased length of ICU and hospital stay (P<0.01). There was a higher mortality rates in patients withPMV (P<0.001).Implications for Practice: Most patients are weaned from mechanical ventilation within 24 hoursuneventfully after isolated CABG. Furthermore, on-pump CABG, prolonged surgery, preoperativerenal insufficiency, and NYHA class 4 were independent predictors of prolonged mechanicalventilation. Identifying the risk factors causing PMV can prevent its adverse consequences

    Endoscopic Findings and Histopathological Patterns of Gastric Mucosal Biopsies in Functional Dyspepsia: A Clinicopathological Study

    Get PDF
    Background: Endoscopic examination of the gastrointestinal tract through macroscopic and histopathological evaluation provides a tool to differentiate the major causes of functional dyspepsia. The distinction is not always clear. This study aimed to assess the frequency and type of the macroscopic and histopathological changes in gastrointestinal tract endoscopy in patients with symptoms of functional dyspepsia. Methods: A cross-sectional study was performed on 97 patients aged 10–85 years who underwent gastroscopy due to functional dyspepsia symptoms. The patients had no history of weight loss, major comorbidities like diabetes or cirrhosis, non-steroidal anti- inflammatory drug (NSAID) consumption, peptic ulcer, or any other confounding causes. Biopsy specimens were taken from the stomach and duodenum for histopathological examination. The presence of Helicobacter pylori infection was established based on histopathological examination and a positive rapid urease test. Results: Gastric biopsies of 97 patients with functional dyspepsia were studied. In histological examination of gastric mucosal biopsies, chronic inflammation was present in 94 (96.9%), activity was seen in 47 (48.5%), glandular atrophy was seen in 3 (3.1%), and intestinal metaplasia was seen in 9 (9.2%) patients. H. pylori was identified on gastric mucosal biopsies in 46 (47.4%) patients based on sections stained with H&E and Giemsa. Conclusion: According to the obtained results, it is concluded that patients with functional dyspepsia have a higher frequency of gastric mucosal inflammation and H. pylori infection

    Mapping 123 million neonatal, infant and child deaths between 2000 and 2017

    Get PDF
    Since 2000, many countries have achieved considerable success in improving child survival, but localized progress remains unclear. To inform efforts towards United Nations Sustainable Development Goal 3.2—to end preventable child deaths by 2030—we need consistently estimated data at the subnational level regarding child mortality rates and trends. Here we quantified, for the period 2000–2017, the subnational variation in mortality rates and number of deaths of neonates, infants and children under 5 years of age within 99 low- and middle-income countries using a geostatistical survival model. We estimated that 32% of children under 5 in these countries lived in districts that had attained rates of 25 or fewer child deaths per 1,000 live births by 2017, and that 58% of child deaths between 2000 and 2017 in these countries could have been averted in the absence of geographical inequality. This study enables the identification of high-mortality clusters, patterns of progress and geographical inequalities to inform appropriate investments and implementations that will help to improve the health of all populations
    corecore